An Efficient Algorithm for Calculating the Heat Capacity of a Large-Scale Molecular System

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

An efficient algorithm for large-scale detection of protein families.

Detection of protein families in large databases is one of the principal research objectives in structural and functional genomics. Protein family classification can significantly contribute to the delineation of functional diversity of homologous proteins, the prediction of function based on domain architecture or the presence of sequence motifs as well as comparative genomics, providing valua...

متن کامل

Simple and Efficient Algorithm for Large Scale Molecular Dynamics Simulation in Hard Disk System

A simple and efficient algorithm of the molecular-dynamics simulation of the hard disk system based on the Event-Driven method is developed. From the analysis of algorithm, the complexity is O(logN) per 1 event, and the constant coefficient of the complexity is smaller than conventional efficient algorithm based on the concept of Cell-Crossing Event. The maximum performance of more than 460 mil...

متن کامل

An Efficient MapReduce Algorithm for Parallelizing Large-scale Graph Clustering

Identifying close-knit communities (or “clusters”) in graphs is an advanced operation with a broad range of scientific applications. While theoretical formulations of this operation are either intractable or computationally prohibitive, practical algorithmic heuristics exist to efficiently tackle the problem. However, implementing these heuristics to work for large real world graphs still remai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Macromolecular Theory and Simulations

سال: 2001

ISSN: 1022-1344,1521-3919

DOI: 10.1002/1521-3919(20011001)10:8<756::aid-mats756>3.0.co;2-e